Global Stability, Two Conjectures and Maple

نویسندگان

  • Roger D. Nussbaum
  • ROGER D. NUSSBAUM
چکیده

We prove this conjecture in case (a) and signi cantly extend the range of p and q for which it is known in case (b). In cases (a) and (b), these questions are equivalent to global stability of the xed point (L;L) of the planar map (u; v) = (v; f(u; v)). For as in case (a), we consider natural four dimensional extensions T of 3 and S of . For 0 q < p, we prove that (L;L; L; L) is a global stable xed point of T , but we also describe precisely a range of parameters 0 q < p for which S has at least three distinct xed points in the positive orthant. We describe (Section 3) some general principles underlying our arguments. Symbolic calculations using Maple play a crucial role in our arguments in Section 4.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Automated conjecture making in number theory using HR, Otter and Maple

One of the main applications of computational techniques to pure mathematics has been the use of computer algebra systems to perform calculations which mathematicians cannot perform by hand. Because the data is produced within the computer algebra system, this becomes an environment for the exploration of new functions and the data produced is often analysed in order to make conjectures empiric...

متن کامل

A New Algorithm for Proving Global Asymptotic Stability of Rational Difference Equations

Global asymptotic stability of rational difference equations is an area of research that has been well studied. In contrast to the many current methods for proving global asymptotic stability, we propose an algorithmic approach. The algorithm we summarize here employs the idea of contractions. Given a particular rational difference equation, defined by a function Q : R → R, we attempt to find a...

متن کامل

Disturbing the Dyson Conjecture (in a GOOD Way)

We present a case study in experimental yet rigorous mathematics by describing an algorithm, fully implemented in both Mathematica and Maple, that automatically conjectures, and then automatically proves, closed-form expressions extending Dyson’s celebrated constant term conjecture.

متن کامل

Dynamics of higher order rational difference equation $x_{n+1}=(alpha+beta x_{n})/(A + Bx_{n}+ Cx_{n-k})$

The main goal of this paper is to investigate the periodic character, invariant intervals, oscillation and global stability and other new results of all positive solutions of the equation$$x_{n+1}=frac{alpha+beta x_{n}}{A + Bx_{n}+ Cx_{n-k}},~~ n=0,1,2,ldots,$$where the parameters $alpha$, $beta$, $A$, $B$ and $C$ are positive, and the initial conditions $x_{-k},x_{-k+1},ldots,x_{-1},x_{0}$ are...

متن کامل

Computing monodromy via continuation methods on random Riemann surfaces

We consider a Riemann surface X defined by a polynomial f(x, y) of degree d, whose coefficients are chosen randomly. Hence, we can suppose that X is smooth, that the discriminant δ(x) of f has d(d− 1) simple roots, ∆, and that δ(0) 6= 0 i.e. the corresponding fiber has d distinct points {y1, . . . , yd}. When we lift a loop 0 ∈ γ ⊂ C−∆ by a continuation method, we get d paths in X connecting {y...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005